Applications of Average Geodesic Distance in Manifold Learning
نویسنده
چکیده
Manifold learning has become a hot issue in the research fields of machine learning and data mining. Current manifold learning algorithms assume that the observed data set has the high density. But, how to evaluate the denseness of the high dimensional observed data set? This paper proposes an algorithm based on the average geodesic distance as the preprocessing step of manifold learning. Moreover, for a high dense data set evaluated, we further utilize the average geodesic distance to quantitatively analyze the mapping relationship between the highdimensional manifold and the corresponding intrinsic low-dimensional manifold in the known ISOMAP algorithm. Finally, experimental results on two synthetic Swiss-roll data sets show that our method is feasible.
منابع مشابه
Text Classification Based On Manifold Semi- Supervised Support Vector Machine
This article presents a solution along with experimental results for an application of semi-supervised machine learning techniques and improvement on the SVM (Support Vector Machine) based on geodesic model to build text classification applications for Vietnamese language. The objective here is to improve the semi-supervised machine learning by replacing the kernel function of SVM using geodesi...
متن کاملSparse Geodesic Paths
In this paper we propose a new distance metric for signals that admit a sparse representation in a known basis or dictionary. The metric is derived as the length of the sparse geodesic path between two points, by which we mean the shortest path between the points that is itself sparse. We show that the distance can be computed via a simple formula and that the entire geodesic path can be easily...
متن کاملManifold Constrained Finite Gaussian Mixtures
In many practical applications, the data is organized along a manifold of lower dimension than the dimension of the embedding space. This additional information can be used when learning the model parameters of Gaussian mixtures. Based on a mismatch measure between the Euclidian and the geodesic distance, manifold constrained responsibilities are introduced. Experiments in density estimation sh...
متن کاملShamap: Shape-based Manifold Learning
For manifold learning, it is assumed that high-dimensional sample/data points are on an embedded low-dimensional manifold. Usually, distances among samples are computed to represent the underlying data structure, for a specified distance measure such as the Euclidean distance or geodesic distance. For manifold learning, here we propose a metric according to the angular change along a geodesic l...
متن کاملA Geometry Preserving Kernel over Riemannian Manifolds
Abstract- Kernel trick and projection to tangent spaces are two choices for linearizing the data points lying on Riemannian manifolds. These approaches are used to provide the prerequisites for applying standard machine learning methods on Riemannian manifolds. Classical kernels implicitly project data to high dimensional feature space without considering the intrinsic geometry of data points. ...
متن کامل